Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
نویسندگان
چکیده
منابع مشابه
Residue-to-Binary Arithmetic Converter for the Moduli Set
In this paper we investigate residue number system to binary converter algorithms for special moduli sets. A new five moduli set proposed is shown to exhibit high speed forward and reverse conversion properties. The architectures are memoryless and area efficient.
متن کاملAn Efficient RNS to Binary Converter Using the Moduli Set
In this paper, we investigate Residue Number System (RNS) to decimal conversion which is an important issue concerning the utilization of RNS numbers in Digital Signal Processing (DSP) applications. We propose a reverse converter using the moduli set {2n+1, 2n, 2n−1}. First, we show that this converter does not require the computation of multiplicative inverses. Next, we simplify the Chinese Re...
متن کاملAn Power Efficient New CRT Based Reverse Converter for Moduli
The 4-moduli{ } set has been recently proposed for large dynamic range of 6n-bits .for this 4moduli set reverse converter design based on New CRT-1 and MRC has already been proposed. In this paper we propose reverse converter design for 4-moduli set{ }based on New CRT-II theorem to achieve more efficient residue number system(RNS) than the former one. The design is achieved using carry save add...
متن کاملA Residue to Binary Converter for the {2n + 2, 2n + 1, 2n} Moduli Set
In this paper, we investigate Residue Number System (RNS) to decimal conversion for a three moduli set with a common factor. We propose a new RNS to binary converter for the moduli set {2n + 2, 2n + 1, 2n} for any even integer n > 0. First, we demonstrate that for such a moduli set, the computation of the multiplicative inverses can be eliminated. Secondly, we simplify the Chinese Remainder The...
متن کاملAn Efficient FPGA Design of Residue-to-Binary Converter for the Moduli Set 2n+1, 2n, 2n-1
In this paper, we propose a novel reverse converter for the moduli set {2n + 1, 2n, 2n − 1}. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that uses mod(2n−1) operations. Next, we present a low complexity implementation that does not require the explicit use of modulo operation in the conversion process and we prove that theoretically speaking it outper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2010
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-010-4133-3